Contrasat - A Contrarian SAT Solver
نویسنده
چکیده
The SAT solver Contrasat is a small variation of the well-established Minisat solver. It was entered in the Minisat hack track of the 2011 SAT competition, and was judged to be first place in one category. This paper describes the code change and its motivation. The characterization as “contrarian” is explained. Experimental results are summarized.
منابع مشابه
Contrasat – A Contrarian SAT Solver system description
The SAT solver Contrasat is a small variation of the well-established Minisat solver. It was entered in the Minisat hack track of the 2011 SAT competition, and was judged to be first place in one category. This paper describes the code change and its motivation. The characterization as “contrarian” is explained. Experimental results are summarized.
متن کاملA Fast SAT Solver for Isabelle in Standard ML
This contribution contains a fast SAT solver for Isabelle written in Standard ML. By loading the theory DPT SAT Solver, the SAT solver installs itself (under the name “dptsat”) and certain Isabelle tools like Refute will start using it automatically. This is a port of the DPT (Decision Procedure Toolkit) SAT Solver written in OCaml. Theory DPT SAT Tests tests the solver on a few hundred problems.
متن کاملParallel SAT Solver Selection and Scheduling
Combining differing solution approaches by means of solver portfolios has proven as a highly effective technique for boosting solver performance. We consider the problem of generating parallel SAT solver portfolios. Our approach is based on a recently introduced sequential SAT solver portfolio that excelled at the last SAT competition. We show how the approach can be generalized for the paralle...
متن کاملFrom Total Assignment Enumeration to Modern SAT Solver
A new framework for presenting and analyzing the functionality of a modern DLL-based SAT solver is proposed. Our approach exploits the inherent relation between backtracking and resolution. We show how to derive the algorithm of a modern SAT solver from DLL stepby-step. We analyze the inference power of Boolean Constraint Propagation, Non-Chronological Backtracking and 1UIP-based Conflict-Direc...
متن کاملversat: A Verified Modern SAT Solver
This paper presents versat, a formally verified SAT solver incorporating the essential features of modern SAT solvers, including clause learning, watched literals, optimized conflict analysis, non-chronological backtracking, and decision heuristics. Unlike previous related work on SAT-solver verification, our implementation uses efficient low-level data structures like mutable C arrays for clau...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JSAT
دوره 8 شماره
صفحات -
تاریخ انتشار 2012